Quantum Biased Oracles
نویسندگان
چکیده
منابع مشابه
Using Biased Coins as Oracles
While it is well known that a Turing machine equipped with the ability to flip a fair coin cannot compute more than a standard Turing machine, we show that this is not true for a biased coin. Indeed, any oracle set X may be coded as a probability pX such that if a Turing machine is given a coin which lands heads with probability pX it can compute any function recursive in X with arbitrarily hig...
متن کاملQuantum Computation Relative to Oracles
The study of the power and limitations of quantum computation remains a major challenge in complexity theory. Key questions revolve around the quantum complexity classes EQP, BQP, NQP and their derivatives. This paper presents new relativized worlds in which (i) co-RP * NQE, (ii) P = BQP and UP = EXP, (iii) P = EQP and RP = EXP, and (iv) EQP * Σ 2 ∪Π P 2 . We also show a partial answer to the q...
متن کاملQuantum Identification of Boolean Oracles
The oracle identification problem (OIP) is, given a set S of M Boolean oracles out of 2 ones, to determine which oracle in S is the current black-box oracle. We can exploit the information that candidates of the current oracle is restricted to S. The OIP contains several concrete problems such as the original Grover search and the Bernstein-Vazirani problem. Our interest is in the quantum query...
متن کامل(Bandit) Convex Optimization with Biased Noisy Gradient Oracles
Algorithms for bandit convex optimization and online learning often rely on constructing noisy gradient estimates, which are then used in appropriately adjusted first-order algorithms, replacing actual gradients. Depending on the properties of the function to be optimized and the nature of “noise” in the bandit feedback, the bias and variance of gradient estimates exhibit various tradeoffs. In ...
متن کاملRandom Oracles in a Quantum World
The interest in post-quantum cryptography — classical systems that remain secure in the presence of a quantum adversary — has generated elegant proposals for new cryptosystems. Some of these systems are set in the random oracle model and are proven secure relative to adversaries that have classical access to the random oracle. We argue that to prove post-quantum security one needs to prove secu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IPSJ Digital Courier
سال: 2005
ISSN: 1349-7456
DOI: 10.2197/ipsjdc.1.461